Efficient Token Clustering on Hypercubes
نویسندگان
چکیده
We study a combinatorial problem, called token clustering, on a hypercube: given N colored tokens (k tokens per color) each one placed on one processor of the N-node hypercube, cluster all the tokens with the same color into the same k-node subcube. This problem has natural applications in several areas. We propose a distributed algorithm to solve the clustering problem on hypercubes and show some of its applications.
منابع مشابه
Optimal permutation routing for low-dimensional hypercubes
We consider the offline problem of routing a permutation of tokens on the nodes of a d-dimensional hypercube, under a queueless MIMD communication model (under the constraints that each hypercube edge may only communicate one token per communication step, and each node may only be occupied by a single token between communication steps). For a d-dimensional hypercube, it is easy to see that d co...
متن کاملThe Impact of Wiring Constraints on Hierarchical Network Performance
A unified approach, incorporating architectural and packaging issues, is necessary in the design of high performance computer networks. Clustering enables us to exploit the physical hierarchy imposed by packaging. In [HsYe91], we examined the clustering of hypercube networks within the context of wiring constraints. Here, we extend our earlier work to compare the performance of hypercubes and m...
متن کاملA General Construction for Space-filling Latin Hypercubes
Abstract: We propose a general method for constructing Latin hypercubes of flexible run sizes for computer experiments. The method makes use of arrays with a special structure and Latin hypercubes. By using different such arrays and Latin hypercubes, the proposed method produces various types of Latin hypercubes including orthogonal and nearly orthogonal Latin hypercubes, sliced Latin hypercube...
متن کاملType Level Clustering Evaluation: New Measures and a POS Induction Case Study
Clustering is a central technique in NLP. Consequently, clustering evaluation is of great importance. Many clustering algorithms are evaluated by their success in tagging corpus tokens. In this paper we discuss type level evaluation, which reflects class membership only and is independent of the token statistics of a particular reference corpus. Type level evaluation casts light on the merits o...
متن کاملClustering on a Hypercube Multicomputer
In this paper, squared error clustering algorithms for SIMD hypercubes are presented. These algorithms are asymptotically faster than previously known algorithms and require lesser amount of memory per PE. For a clustering problem with .V patterns, M features per pattern and I< clusters, our algorithms complete in O(k + logd%-dI) steps on S-ZI processor hypercubes. This is optimal up to a const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995